Coinductive Algorithms for Büchi Automata

We propose a new algorithm for checking language equivalence of non-deterministic Büchi automata. start from construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem that automata on finite words. Although this generates large highly automata, we show how exploit their specific structure apply state-of-the art techniques based coinduction state-space has be explored. Doing so, obtain algorithms do not require full determinisation or complementation.